Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
نویسندگان
چکیده
منابع مشابه
Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
Producing clear and intelligible layouts of hierarchical digraphs knows a renewed interest in information visualization. Recent experimental results show that metaheuristics are well-adapted methods for this problem. In this paper, we develop a new Hybridized Genetic Algorithm for arc crossing minimization. It follows the basic scheme of a GA with two major differences: problem-based crossovers...
متن کاملDynamic Graph Drawing with a Hybridized Genetic Algorithm
Automatic graph drawing algorithms, especially those for hierarchical digraphs, have an important place in computer-aided design software or more generally in software programs where an efficient visualization tool for complex structure is required. In these cases, aesthetics plays a major role for generating readable and understandable layouts. Besides, in an interactive approach, the program ...
متن کاملMinimizing Stoppage Cost of an Assembly Line Using Genetic Algorithm
This paper presents a nonlinear mixed-integer programming model to minimize the stoppage cost of mixed-model assembly lines. Nowadays, most manufacturing firms employ this type of line due to the increasing varieties of products in their attempts to quickly respond to diversified customer demands. Advancement of new technologies, competitiveness, diversification of products, and large customer ...
متن کاملBreaking Cycles for Minimizing Crossings
We consider the one-sided crossing minimization problem (CP): given a bipartite graph G and a permutation x0 of the vertices on a layer, find a permutation x1 of the vertices on the other layer which minimizes the number of edge crossings in any straightline drawing of G where vertices are placed on two parallel lines and sorted according to x0 and x1. Solving CP represents a fundamental step i...
متن کاملMinimizing Stoppage Cost of an Assembly Line Using Genetic Algorithm
This paper presents a nonlinear mixed-integer programming model to minimize the stoppage cost of mixed-model assembly lines. Nowadays, most manufacturing firms employ this type of line due to the increasing varieties of products in their attempts to quickly respond to diversified customer demands. Advancement of new technologies, competitiveness, diversification of products, and large customer ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2006
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-006-4296-7